λ¬Έμ
Programmers - νλ ¬ ν λ리 νμ νκΈ°
π Logic
private int rotation(int x1, int y1, int x2, int y2) {...}
- μ£Όμ΄μ§ λ μ’νλ₯Ό κΈ°μ€μΌλ‘, μΌμͺ½ μ€, μλ« μ€, μ€λ₯Έμͺ½ μ€, μ μ€ μμΌλ‘ νλ ¬μ νμ μν€λ©΄μ, μ΅μκ°μ μ°Ύλ ν¨μ
π CODE
μ½λ 보기/μ κΈ°π«
class Solution {
static int[][] map;
public int[] solution(int rows, int columns, int[][] queries) {
int[] answer = new int[queries.length];
int idx = 0;
init(rows, columns);
for (int[] query : queries)
answer[idx++] = rotation(query[0] - 1, query[1] - 1, query[2] - 1, query[3] - 1);
return answer;
}
private void init(int rows, int columns) {
map = new int[rows][columns];
int num = 1;
for (int i = 0; i < rows; i++)
for (int j = 0; j < columns; j++)
map[i][j] = num++;
}
private int rotation(int x1, int y1, int x2, int y2) {
int w = y2 - y1;
int h = x2 - x1;
int value = map[x1][y1];
int min = value;
// μΌμͺ½ μ€ μ΄λ
for (int i = x1 + 1; i <= x1 + h; i++) {
int moveN = map[i][y1];
if (min > moveN) min = moveN;
map[i - 1][y1] = moveN;
}
// μλ« μ€ μ΄λ
for (int j = y1 + 1; j <= y1 + w; j++) {
int moveN = map[x2][j];
if (min > moveN) min = moveN;
map[x2][j - 1] = moveN;
}
// μ€λ₯Έμͺ½ μ€ μ΄λ
for (int i = x2 - 1; i >= x1; i--) {
int moveN = map[i][y2];
if (min > moveN) min = moveN;
map[i + 1][y2] = moveN;
}
// μ μ€ μ΄λ
for (int j = y2 - 1; j > y1; j--) {
int moveN = map[x1][j];
if (min > moveN) min = moveN;
map[x1][j + 1] = moveN;
}
map[x1][y1 + 1] = value;
return min;
}
}
βοΈ Review
- λ¬Έμ μ체λ μ¬μ°λ, μΈλ±μ€ 보λ€κ° λμ λΉ μ Έλ²λ¦¬λ λ¬Έμ